IS

Ramirez, Richard G.

Topic Weight Topic Terms
0.495 database language query databases natural data queries relational processing paper using request views access use
0.169 approach analysis application approaches new used paper methodology simulation traditional techniques systems process based using
0.133 workflow tools set paper management specification command support formal implemented scenarios associated sequence large derived

Focal Researcher     Coauthors of Focal Researcher (1st degree)     Coauthors of Coauthors (2nd degree)

Note: click on a node to go to a researcher's profile page. Drag a node to reallocate. Number on the edge is the number of co-authorships.

Kulkarni, Uday R. 1 Moser, Kathleen A. 1
"what-if" analysis 1 hypothetical databases 1 relational databases 1 relational views 1
view updates 1

Articles (1)

Performance Analysis of "What-If" Databases Using Independently Updated Views. (Journal of Management Information Systems, 1992)
Authors: Abstract:
    Multiple scenarios are critical to "what-if" analysis. Scenarios are built using alternate versions of a database; each version shows, in detail, the result of a decision or a combination of decisions. Relational database management systems, despite their widespread use, lack the explicit capabilities for what-if analysis. We present a concept called independently updated views (IUVs) for creating multiple scenarios. An IUV corresponds to a version of the database. Each version is manipulated and updated as if it were the "real" database; however, only differences between the version and the real database are stored. This paper describes an experiment for measuring the overhead of using IUVs for supporting what-if analysis for a range of typical views and queries. Results indicate that the overhead is minimal for creating what-if scenarios based on views with aggregate functions (SUM, AVG) and on views that are small subsets of the database. These are the classes of views that are more often used in decision making. For views that require retrieval of entire or large portions of the database, the overhead can be high and special data structures may be required.